Improved Performance of Mean Greedy Algorithm for Chunk Allocation in SC Joint-User and Chunk

نویسندگان

  • Arfianto Fahmi
  • Dadang Gunawan
چکیده

In this paper, basis in SC-FDMA uplink systems is investiga greedy algorithms are proposed allocation at each transmission time interval. Selection criteria based on spectral efficiency and fairness are also proposed to choose the final allocatio transmission time interval. Simulation results show that when the number of users and the velocity of the users were varied, the improved algorithms that use selection criteria based on spectral efficiency and fairness could outperform the existing mean greedy algorithms that employ user spectral efficiency and fairness. Moreover, the improved algorithms not only showed better performance but also had the same time complexity as the existing mean greedy algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Combined User-order and Chunk-order Algorithm to Minimize the Average BER for Chunk Allocation in SC- FDMA Systems

A Chunk by chunk-based allocation is an emerging subcarrier allocation in Single Carrier Frequency Division Multiple Access (SC-FDMA) due to its low complexity. In this paper, a combined userorder and chunk-order allocation for solving chunk allocation problem which minimizes the average BER of all users while improving the throughput in SC-FDMA uplink is proposed. The subcarrier grouping into ...

متن کامل

Combined-order Algorithm using Promethee Method Approach and Analytic Hierarchy Decision for Chunk Allocation in LTE Uplink Systems

The problem of chunk-based resource allocation for the uplink of Long Term Evolution is investigated. In this paper, a combined order using the promethee method and analytic hierarchy decision for chunk allocation algorithm is proposed. The utility of each order is sorted based on promethee method approach so that the utility of each order could be approximated as the average of all criteria on...

متن کامل

Priority-based Chunk Scheduling Algorithm for Large Scale P2P Live Streaming System

Chunk-based mesh-pull Peer-to-Peer (P2P) streaming is being considered as the most promising approach to deliver real-time video to large scale users over the Internet. Chunk scheduling is one of the key components. Currently the majorities of chunk scheduling approaches focus on receiver side’s chunk/peer selection strategies. And most of previous research works neglect the service order and a...

متن کامل

Opportunistic Capacity-Based Resource Allocation for Chunk-Based Multi-Carrier Cognitive Radio Sensor Networks

The spectrum allocation for cognitive radio sensor networks (CRSNs) has received considerable research attention under the assumption that the spectrum environment is static. However, in practice, the spectrum environment varies over time due to primary user/secondary user (PU/SU) activity and mobility, resulting in time-varied spectrum resources. This paper studies resource allocation for chun...

متن کامل

An Efficient Supplier Side Scheduling Algorithm for P2P Live Streaming System

Chunk scheduling is one of the key components in P2P streaming systems. Most of previous research works focus on receiver side’s chunk/peer selection strategies and neglect the service order and available uplink bandwidth allocation problem at supplier side, which will cause the user’s video quality descending under overloaded operating environments. In this paper, we propose the supplier side ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013